Liner Network Design under Consideration of Transit Times and Partner Networks
نویسندگان
چکیده
This paper presents an evolutionary algorithm for the network design problem in the liner shipping industry with focus on the fitness calculation. The main contribution of this work are several new business constraints, such as committed partner capacities using a maximum flow algorithm and the transit times using a shortest path evaluation. Beside the cargo flows, the transit times are important parameters for the network design and play a major role when selecting a carrier. The algorithm uses a multi-commodity flow network with different layers and linearized bunker costs to calculate the overall network’s profit.
منابع مشابه
Application of A Route Expansion Algorithm for Transit Routes Design in Grid Networks
Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...
متن کاملطراحی یک مدل یادگیری تمیزدهنده جهت بهبود مسیرهای اتوبوس در شبکهی حمل و نقل بهینه
Design a Bus Transit Network is an important problem of the Urban Management. There are a large number of variables that must be considered to design a bus transit network. These variables are used to reach a set of goals such as accessibility, maximum coverage, reduction of waiting time and decrease operational costs and number of transfer between line stops. Design a Bus Transit Network is NP...
متن کاملA Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions
We present a mathematical model for the liner shipping network design problem with transit time restrictions on the cargo flow. We extend an existing matheuristic for the liner shipping network design problem to consider transit time restrictions. The matheuristic is an improvement heuristic, where an integer program is solved iteratively as a move operator in a large-scale neighborhood search....
متن کاملCreating Bus Timetables Under Stochastic Demand
Local bus network is the most popular transit mode and the only available transit mode in the majority of cities of the world. Increasing the utility of this mode which increases its share from urban trips is an important goal for city planners. Timetable setting as the second component of bus network design problem (network route design timetable setting vehicle assignment crew assignment) hav...
متن کاملCompetitive Liner Shipping Network Design Management Science DTU Management Engineering
We present a solution method for the liner shipping network design problem which is a core strategic planning problem faced by container carriers. We propose the first practical algorithm which explicitly handles transshipment time limits for all demands. Individual sailing speeds at each service leg are used to balance sailings speed against operational costs, hence ensuring that the found net...
متن کامل